Learning near-optimal search in a minimal explore/exploit task
نویسندگان
چکیده
How well do people search an environment for non-depleting resources of different quality, where it is necessary to switch between exploring for new resources and exploiting those already found? Employing a simple card selection task to study exploitation and exploration, we find that the total resources accrued, the number of switches between exploring and exploiting, and the number of trials until stable exploitation becomes more similar to those of the optimal strategy as experience increases across searches. Subjects learned to adjust their effective (implicit) thresholds for exploitation toward the optimal threshold over 30 searches. Those implicit thresholds decrease over turns within each search, just as the optimal threshold does, but subjects’ explicitly stated exploitation threshold increases over turns. Nonetheless, both the explicit and learned implicit thresholds produced performance close to optimal.
منابع مشابه
Learning and choosing in an uncertain world: An investigation of the explore-exploit dilemma in static and dynamic environments.
How do people solve the explore-exploit trade-off in a changing environment? In this paper we present experimental evidence from an "observe or bet" task, in which people have to determine when to engage in information-seeking behavior and when to switch to reward-taking actions. In particular we focus on the comparison between people's behavior in a changing environment and their behavior in a...
متن کاملGravitational Search Algorithm to Solve the K-of-N Lifetime Problem in Two-Tiered WSNs
Wireless Sensor Networks (WSNs) are networks of autonomous nodes used for monitoring an environment. In designing WSNs, one of the main issues is limited energy source for each sensor node. Hence, offering ways to optimize energy consumption in WSNs which eventually increases the network lifetime is strongly felt. Gravitational Search Algorithm (GSA) is a novel stochastic population-based meta-...
متن کاملA new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems
Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...
متن کاملیادگیری از جامعه مورچگان در بهینهسازی دیوارهای حائل بتنی
: In the present paper, lessons are learnt from ant society so that humankind can optimize his engineering issues. As an example of such issues, a reinforced concrete retaining wall for which the application of optimization can reduce the costs involved is considered. Traditional design procedure for reinforced concrete retaining walls is unable to design an optimized wall unless a large trial ...
متن کاملHybrid Teaching-Learning-Based Optimization and Harmony Search for Optimum Design of Space Trusses
The Teaching-Learning-Based Optimization (TLBO) algorithm is a new meta-heuristic algorithm which recently received more attention in various fields of science. The TLBO algorithm divided into two phases: Teacher phase and student phase; In the first phase a teacher tries to teach the student to improve the class level, then in the second phase, students increase their level by interacting amon...
متن کامل